Termination w.r.t. Q of the following Term Rewriting System could not be shown:
Q restricted rewrite system:
The TRS R consists of the following rules:
a(b(a(b(x)))) → b(a(b(a(a(b(x))))))
Q is empty.
↳ QTRS
↳ DependencyPairsProof
Q restricted rewrite system:
The TRS R consists of the following rules:
a(b(a(b(x)))) → b(a(b(a(a(b(x))))))
Q is empty.
Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:
A(b(a(b(x)))) → A(a(b(x)))
A(b(a(b(x)))) → A(b(a(a(b(x)))))
The TRS R consists of the following rules:
a(b(a(b(x)))) → b(a(b(a(a(b(x))))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
A(b(a(b(x)))) → A(a(b(x)))
A(b(a(b(x)))) → A(b(a(a(b(x)))))
The TRS R consists of the following rules:
a(b(a(b(x)))) → b(a(b(a(a(b(x))))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.